1) According to the graph theory of loop analysis, how many equilibrium equations are required at a minimum level in terms of number of branches (b) and number of nodes (n) in the graph?
a. n-1
b. b+(n-1)
c. b-(n-1)
d. b/ n-1
|
Answer
Explanation
|
ANSWER: b-(n-1)
Explanation:
No explanation is available for this question!
|
|
2) What would be an order of branch impedance matrix for the below stated KVL equilibrium equation on the basis of loop or mesh analysis?
E = B (Vs – Zb Is)
a. b x 1
b. b x b
c. b-n+1) x 1
d. (b-n+1) x b
|
Answer
Explanation
|
ANSWER: b x b
Explanation:
No explanation is available for this question!
|
|
3) Consider the assertions given below. Which among them do/does not specify/ies the property of 'Complete Incidence Matrix'?
a. Determinant of a loop of a complete incidence matrix is always zero
b. Addition of all entries in any column should never be equal to zero
c. Rank of connected or oriented graph is always 'n-1'
d. All of the above
|
Answer
Explanation
|
ANSWER: Addition of all entries in any column should never be equal to zero
Explanation:
No explanation is available for this question!
|
|
4) Which parameter should be essentially equal to the number of nodes in the network in accordance to the principle of duality?
a. Total impedance
b. Total admittance
c. Number of meshes
d. Number of voltage sources
|
Answer
Explanation
|
ANSWER: Number of meshes
Explanation:
No explanation is available for this question!
|
|
5) How many fundamental cutsets will be generated for a graph with 'n' number of nodes?
a. n+1
b. n-1
c. n 2(n-1)
d. n/ n-1
|
Answer
Explanation
|
ANSWER: n-1
Explanation:
No explanation is available for this question!
|
|
6) What will be the number of trees, if the graph exhibits reduction in the form of reduced incident matrix given below?
a. 16
b. 24
c. 26
d. 28
|
Answer
Explanation
|
ANSWER: 24
Explanation:
No explanation is available for this question!
|
|
7) According to the linear graph theory, the number of possible trees is always equal to the determinant of product of ______
a. Only complete incidence matrix
b. Reduced incidence matrix & its transpose
c. Cut-Set matrix
d. Tie-set matrix
|
Answer
Explanation
|
ANSWER: Reduced incidence matrix & its transpose
Explanation:
No explanation is available for this question!
|
|
8) What will be the value of a rectangular (complete incidence) matrix, if an associated branch is oriented towards the node?
a. 1
b. -1
c. 0
d. Not defined (∞)
|
Answer
Explanation
|
ANSWER: -1
Explanation:
No explanation is available for this question!
|
|
9) How many number of minimum end nodes or terminal nodes are involved in a tree, according to its properties?
a. Only one
b. Two
c. Four
d. Infinite
|
Answer
Explanation
|
ANSWER: Two
Explanation:
No explanation is available for this question!
|
|
10) Which among the below specified assertions are precisely related to the conditions applicable for a path to be an improper subgraph?
A. Incidence of a single branch at a terminating node
B. Incidence of two branches at the remaining nodes
a. A is true & B is false
b. A is false & B is true
c. Both A & B are true
d. Both A & B are false
|
Answer
Explanation
|
ANSWER: Both A & B are true
Explanation:
No explanation is available for this question!
|
|
